Numerical Computation of Rank - One Convex
نویسنده
چکیده
We describe an algorithm for the numerical computation of the rank-one convex envelope of a function f : Mm×n → R. We prove its convergence and an error estimate in L∞.
منابع مشابه
A numerical iterative scheme for computing finite order rank-one convex envelopes
Abstract. It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient numerical scheme for the computation of the finite order rank-one convex envelopes arises. In this paper, we develop an iterative scheme for such a purpose. The 1-st order rank-one convex envelope R1f is appro...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملMultiscale Modelling and Computation of Microstructures in Multi-well Problems
A multiscale model and numerical method for computing microstructures with large and inhomogeneous deformation is established, in which the microscopic and macroscopic information is recovered by coupling the finite order rank-one convex envelope and the finite element method. The method is capable of computing microstructures which are locally finite order laminates. Numerical experiments on a...
متن کاملPhaseliftoff: an Accurate and Stable Phase Retrieval Method Based on Difference of Trace and Frobenius Norms∗
Phase retrieval aims to recover a signal x∈Cn from its amplitude measurements |〈x,ai〉|, i= 1,2, · ·· ,m, where ai’s are over-complete basis vectors, with m at least 3n−2 to ensure a unique solution up to a constant phase factor. The quadratic measurement becomes linear in terms of the rank-one matrix X=xx∗. Phase retrieval is then a rank-one minimization problem subject to linear constraint for...
متن کاملT5-configurations and Non-rigid Sets of Matrices
In 2003 B. Kirchheim-D. Preiss constructed a Lipschitz map in the plane with 5 incompatible gradients, where incompatibility refers to the condition that no two of the five matrices are rank-one connected. The construction is via the method of convex integration and relies on a detailed understanding of the rank-one geometry resulting from a specific set of five matrices. The full computation o...
متن کامل